Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
A(b(x1)) → C(b(b(a(x1))))
A(b(x1)) → B(b(a(x1)))
A(b(x1)) → B(a(x1))
A(b(x1)) → A(c(b(b(a(x1)))))
A(b(x1)) → A(x1)
A(b(x1)) → A(a(c(b(b(a(x1))))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(x1)) → C(b(b(a(x1))))
A(b(x1)) → B(b(a(x1)))
A(b(x1)) → B(a(x1))
A(b(x1)) → A(c(b(b(a(x1)))))
A(b(x1)) → A(x1)
A(b(x1)) → A(a(c(b(b(a(x1))))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(x1)) → A(c(b(b(a(x1)))))
A(b(x1)) → A(x1)
A(b(x1)) → A(a(c(b(b(a(x1))))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x1)) → A(c(b(b(a(x1))))) at position [0] we obtained the following new rules:
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(x0)) → A(c(b(b(x0))))
A(b(y0)) → A(c(b(a(y0))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(x0)) → A(c(b(b(x0))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(x1)) → A(a(c(b(b(a(x1))))))
A(b(x1)) → A(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x1)) → A(a(c(b(b(a(x1)))))) at position [0] we obtained the following new rules:
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(x0)) → A(a(c(b(b(x0)))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(x0)) → A(c(b(b(x0))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(x0)) → A(a(c(b(b(x0)))))
A(b(x1)) → A(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x0)) → A(c(b(b(x0)))) at position [0] we obtained the following new rules:
A(b(y0)) → A(c(b(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(y0)) → A(c(b(y0)))
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(x1)) → A(x1)
A(b(x0)) → A(a(c(b(b(x0)))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(y0)) → A(c(b(y0))) at position [0] we obtained the following new rules:
A(b(x0)) → A(c(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(x0)) → A(c(x0))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(x0)) → A(a(c(b(b(x0)))))
A(b(x1)) → A(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x0)) → A(c(x0)) at position [0] we obtained the following new rules:
A(b(c(x0))) → A(x0)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(c(x0))) → A(x0)
A(b(x1)) → A(x1)
A(b(x0)) → A(a(c(b(b(x0)))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(c(x0))) → A(x0)
A(b(x1)) → A(x1)
A(b(x0)) → A(a(c(b(b(x0)))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
A(b(b(x0))) → A(a(c(b(b(a(a(c(b(b(a(x0)))))))))))
A(b(y0)) → A(c(b(a(y0))))
A(b(b(x0))) → A(c(b(b(a(a(c(b(b(a(x0))))))))))
A(b(y0)) → A(a(c(b(a(y0)))))
A(b(y0)) → A(c(b(b(a(y0)))))
A(b(c(x0))) → A(x0)
A(b(x1)) → A(x1)
A(b(x0)) → A(a(c(b(b(x0)))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → A1(b(b(c(A(x)))))
B(b(A(x))) → B(c(a(A(x))))
B(A(x)) → A1(b(c(a(A(x)))))
B(b(A(x))) → C(a(a(b(b(c(a(A(x))))))))
B(b(A(x))) → A1(b(b(c(a(a(b(b(c(a(A(x)))))))))))
B(A(x)) → C(a(A(x)))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(A(x)) → B(b(c(A(x))))
B(A(x)) → C(A(x))
B(A(x)) → B(c(a(A(x))))
B(A(x)) → A1(A(x))
B(a(x)) → C(a(a(x)))
B(a(x)) → B(c(a(a(x))))
B(b(A(x))) → C(a(a(b(b(c(A(x)))))))
B(b(A(x))) → B(b(c(A(x))))
B(b(A(x))) → A1(a(b(b(c(A(x))))))
B(b(A(x))) → C(A(x))
B(a(x)) → A1(b(b(c(a(a(x))))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(a(x)) → A1(a(x))
B(b(A(x))) → B(b(c(a(A(x)))))
B(b(A(x))) → A1(b(b(c(a(A(x))))))
B(b(A(x))) → A1(a(b(b(c(a(A(x)))))))
B(a(x)) → B(b(c(a(a(x)))))
B(A(x)) → B(c(A(x)))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → A1(b(b(c(A(x)))))
B(b(A(x))) → A1(A(x))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(A(x)))
B(b(A(x))) → C(a(A(x)))
B(b(A(x))) → A1(b(b(c(a(a(b(b(c(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
B(A(x)) → A1(b(c(A(x))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → A1(b(b(c(A(x)))))
B(b(A(x))) → B(c(a(A(x))))
B(A(x)) → A1(b(c(a(A(x)))))
B(b(A(x))) → C(a(a(b(b(c(a(A(x))))))))
B(b(A(x))) → A1(b(b(c(a(a(b(b(c(a(A(x)))))))))))
B(A(x)) → C(a(A(x)))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(A(x)) → B(b(c(A(x))))
B(A(x)) → C(A(x))
B(A(x)) → B(c(a(A(x))))
B(A(x)) → A1(A(x))
B(a(x)) → C(a(a(x)))
B(a(x)) → B(c(a(a(x))))
B(b(A(x))) → C(a(a(b(b(c(A(x)))))))
B(b(A(x))) → B(b(c(A(x))))
B(b(A(x))) → A1(a(b(b(c(A(x))))))
B(b(A(x))) → C(A(x))
B(a(x)) → A1(b(b(c(a(a(x))))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(a(x)) → A1(a(x))
B(b(A(x))) → B(b(c(a(A(x)))))
B(b(A(x))) → A1(b(b(c(a(A(x))))))
B(b(A(x))) → A1(a(b(b(c(a(A(x)))))))
B(a(x)) → B(b(c(a(a(x)))))
B(A(x)) → B(c(A(x)))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → A1(b(b(c(A(x)))))
B(b(A(x))) → A1(A(x))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(A(x)))
B(b(A(x))) → C(a(A(x)))
B(b(A(x))) → A1(b(b(c(a(a(b(b(c(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
B(A(x)) → A1(b(c(A(x))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 22 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(c(a(A(x))))
B(b(A(x))) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(A(x))))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(A(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
B(a(x)) → B(c(a(a(x))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x)) → B(c(a(a(x)))) at position [0] we obtained the following new rules:
B(a(y0)) → B(c(a(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(x))) → B(c(a(A(x))))
B(b(A(x))) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(A(x)))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(A(x)) → B(c(a(A(x))))
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(b(c(a(A(x))))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(b(c(A(y0))))
B(b(A(y0))) → B(c(a(A(y0))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(x))) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(A(x)) → B(c(a(A(x))))
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(c(a(y0)))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(c(a(A(x)))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(c(a(A(x))))
B(b(A(x))) → B(b(c(A(x))))
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(y0))) → B(c(A(y0)))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(c(a(A(x))))
B(b(A(x))) → B(b(c(A(x))))
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(b(c(A(x)))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(c(a(A(x))))
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(c(a(y0)))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(y0))) → B(c(A(y0)))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(c(a(A(x))))
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(A(x)) → B(c(a(A(x)))) at position [0] we obtained the following new rules:
B(A(y0)) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(c(a(y0)))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(A(y0)) → B(c(A(y0)))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(A(x)) → B(b(c(A(x))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(A(x)) → B(b(c(A(x)))) at position [0] we obtained the following new rules:
B(A(y0)) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(c(a(y0)))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(A(y0)) → B(c(A(y0)))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(c(a(y0)))
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(y0)) → B(c(a(y0))) at position [0] we obtained the following new rules:
B(a(x0)) → B(c(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(a(x0)) → B(c(x0))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x0)) → B(c(x0)) at position [0] we obtained the following new rules:
B(a(b(A(x0)))) → B(A(x0))
B(a(c(x0))) → B(x0)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(c(x0))) → B(x0)
B(A(x)) → B(b(c(a(A(x)))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(x)) → B(b(c(a(a(x)))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x)) → B(b(c(a(a(x))))) at position [0] we obtained the following new rules:
B(a(y0)) → B(b(c(a(y0))))
B(a(y0)) → B(c(a(a(y0))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(b(c(a(y0))))
B(A(x)) → B(b(c(a(A(x)))))
B(a(c(x0))) → B(x0)
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x))))))))))
B(a(y0)) → B(c(a(a(y0))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(b(c(a(a(b(b(c(a(A(x)))))))))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(b(c(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(a(b(b(c(a(A(y0)))))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(c(x0))) → B(x0)
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(b(c(a(y0))))
B(b(A(x))) → B(c(a(a(b(b(c(a(A(x)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
B(a(y0)) → B(c(a(a(y0))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(c(a(a(b(b(c(a(A(x))))))))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(b(c(A(y0))))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(b(c(a(y0))))
B(A(x)) → B(b(c(a(A(x)))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(x))) → B(b(c(a(a(b(b(c(A(x)))))))))
B(a(y0)) → B(c(a(a(y0))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(b(c(a(a(b(b(c(A(x))))))))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(b(c(A(y0))))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(a(y0)) → B(b(c(a(y0))))
B(A(x)) → B(b(c(a(A(x)))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(a(b(A(x0)))) → B(A(x0))
B(a(y0)) → B(c(a(a(y0))))
B(b(A(x))) → B(c(a(a(b(b(c(A(x))))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(A(x))) → B(c(a(a(b(b(c(A(x)))))))) at position [0] we obtained the following new rules:
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(c(x0))) → B(x0)
B(A(x)) → B(b(c(a(A(x)))))
B(a(y0)) → B(b(c(a(y0))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
B(a(y0)) → B(c(a(a(y0))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(A(x)) → B(b(c(a(A(x))))) at position [0] we obtained the following new rules:
B(A(y0)) → B(c(a(A(y0))))
B(A(y0)) → B(b(c(A(y0))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(A(y0)) → B(b(c(A(y0))))
B(A(y0)) → B(c(a(A(y0))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(a(y0)) → B(c(a(a(y0))))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(y0)) → B(c(a(a(y0)))) at position [0] we obtained the following new rules:
B(a(y0)) → B(c(a(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(A(y0)) → B(b(c(A(y0))))
B(A(y0)) → B(c(a(A(y0))))
B(a(y0)) → B(c(a(y0)))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(c(x0))) → B(x0)
B(a(y0)) → B(b(c(a(y0))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(A(y0)) → B(c(a(A(y0)))) at position [0] we obtained the following new rules:
B(A(y0)) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(A(y0)) → B(c(A(y0)))
B(A(y0)) → B(b(c(A(y0))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(a(y0)) → B(c(a(y0)))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(A(y0)) → B(b(c(A(y0))))
B(a(c(x0))) → B(x0)
B(a(y0)) → B(b(c(a(y0))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(a(y0)) → B(c(a(y0)))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(A(y0)) → B(b(c(A(y0)))) at position [0] we obtained the following new rules:
B(A(y0)) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(A(y0)) → B(c(A(y0)))
B(a(y0)) → B(c(a(y0)))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(c(a(y0)))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(y0)) → B(c(a(y0))) at position [0] we obtained the following new rules:
B(a(x0)) → B(c(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(c(x0))) → B(x0)
B(a(y0)) → B(b(c(a(y0))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(a(x0)) → B(c(x0))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x0)) → B(c(x0)) at position [0] we obtained the following new rules:
B(a(b(A(x0)))) → B(A(x0))
B(a(c(x0))) → B(x0)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(a(b(A(x0)))) → B(A(x0))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(A(y0))) → B(b(c(a(a(b(c(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(a(A(y0)))))))))
B(a(y0)) → B(b(c(a(y0))))
B(a(c(x0))) → B(x0)
B(b(A(y0))) → B(c(a(b(b(c(a(A(y0))))))))
B(b(A(y0))) → B(c(a(a(b(c(a(A(y0))))))))
B(b(A(y0))) → B(b(c(a(b(b(c(A(y0))))))))
B(b(A(y0))) → B(c(a(b(b(c(A(y0)))))))
B(b(A(y0))) → B(b(c(a(a(b(c(a(A(y0)))))))))
B(b(A(y0))) → B(c(a(a(b(c(A(y0)))))))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
a(b(x)) → a(a(c(b(b(a(x))))))
b(x) → x
c(c(x)) → x
A(b(b(x))) → A(a(c(b(b(a(a(c(b(b(a(x)))))))))))
A(b(x)) → A(c(b(a(x))))
A(b(b(x))) → A(c(b(b(a(a(c(b(b(a(x))))))))))
A(b(x)) → A(a(c(b(a(x)))))
A(b(x)) → A(c(b(b(a(x)))))
A(b(c(x))) → A(x)
A(b(x)) → A(x)
A(b(x)) → A(a(c(b(b(x)))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → a(a(c(b(b(a(x))))))
b(x) → x
c(c(x)) → x
A(b(b(x))) → A(a(c(b(b(a(a(c(b(b(a(x)))))))))))
A(b(x)) → A(c(b(a(x))))
A(b(b(x))) → A(c(b(b(a(a(c(b(b(a(x))))))))))
A(b(x)) → A(a(c(b(a(x)))))
A(b(x)) → A(c(b(b(a(x)))))
A(b(c(x))) → A(x)
A(b(x)) → A(x)
A(b(x)) → A(a(c(b(b(x)))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
b(b(A(x))) → a(b(b(c(a(a(b(b(c(a(A(x)))))))))))
b(A(x)) → a(b(c(A(x))))
b(b(A(x))) → a(b(b(c(a(a(b(b(c(A(x))))))))))
b(A(x)) → a(b(c(a(A(x)))))
b(A(x)) → a(b(b(c(A(x)))))
c(b(A(x))) → A(x)
b(A(x)) → A(x)
b(A(x)) → b(b(c(a(A(x)))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
a(b(x)) → a(a(c(b(b(a(x))))))
b(x) → x
c(c(x)) → x
A(b(b(x))) → A(a(c(b(b(a(a(c(b(b(a(x)))))))))))
A(b(x)) → A(c(b(a(x))))
A(b(b(x))) → A(c(b(b(a(a(c(b(b(a(x))))))))))
A(b(x)) → A(a(c(b(a(x)))))
A(b(x)) → A(c(b(b(a(x)))))
A(b(c(x))) → A(x)
A(b(x)) → A(x)
A(b(x)) → A(a(c(b(b(x)))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → a(a(c(b(b(a(x))))))
b(x) → x
c(c(x)) → x
A(b(b(x))) → A(a(c(b(b(a(a(c(b(b(a(x)))))))))))
A(b(x)) → A(c(b(a(x))))
A(b(b(x))) → A(c(b(b(a(a(c(b(b(a(x))))))))))
A(b(x)) → A(a(c(b(a(x)))))
A(b(x)) → A(c(b(b(a(x)))))
A(b(c(x))) → A(x)
A(b(x)) → A(x)
A(b(x)) → A(a(c(b(b(x)))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(a(c(b(b(a(x1))))))
b(x1) → x1
c(c(x1)) → x1
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → a(b(b(c(a(a(x))))))
b(x) → x
c(c(x)) → x
Q is empty.